Edge minimization in de Bruijn graphs

This paper introduces the de Bruijn graph edge minimization problem, which is related to compression of graphs: find order-k with minimum count among all orders. We describe an efficient algorithm that solves this problem. Since problem connected BWT technique called “tunneling”, also describes a way minimize length tunneled in such useful properties for sequence analysis are preserved. Thus, it provides significant progress towards solution open finding optimal disjoint blocks space, as stated Alanko et al. (DCC 2019).